Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
291	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:23 Theoretical computer science Mathematical optimization Network theory Operations research Motion planning Shortest path problem Visibility graph Dynamic programming Pareto efficiency Mathematics Applied mathematics Graph theory
292	Geometric Modeling with a Multiresolution Representation Richard Hammersley Hong-Qian (Karen) Lu Steven Assa Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:02:36 Quadtree Vertex Binary tree Tree Graph Topology Connectivity Path decomposition Graph theory Mathematics 3D computer graphics
293	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Planar graphs Hamiltonian path Polyhedron Dodecahedron Graph theory Theoretical computer science Mathematics
294	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 The slider-pinning problem Audrey Lee ∗† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:27:03 Edge coloring Structural rigidity Matching Graph Graph operations Pseudoforest Path decomposition Graph theory Laman graph Dense graph
295	ISSNGRACE TECHNICAL REPORTS Bidirectionalizing Structural Recursion on Graphs Add to Reading List Source URL: www.biglab.org Language: English - Date: 2011-01-08 13:03:57 Rooted graph Graph operations Matroid theory Median graph Path decomposition Graph theory Mathematics Graph rewriting
296	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Network theory Search algorithms Graph theory Communication Communication complexity Quantum complexity theory Shortest path problem Randomized algorithm Breadth-first search Theoretical computer science Mathematics Applied mathematics
297	Graphs Algorithms Lecture 18: Basic Graph Algorithms [Fa’14] Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:41:03 Graph Tree Eulerian path Adjacency list Directed graph Connected component Line graph Comparability graph Graph theory Adjacency matrix Directed acyclic graph
298	Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:00:09 Graph connectivity Steiner tree problem Tree decomposition Tree Halin graph Chordal graph Graph Path Path decomposition Graph theory Planar graphs Graph operations
299	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Hamilton Circuits in Hexagonal Grid Graphs Kamrul Islam(1) (1) Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:51 Hamiltonian path Graph coloring Graph Path decomposition Edge coloring Graph theory Planar graphs NP-complete problems
300	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics

UPDATE